On the efficiency of optimal algorithms for the joint replenishment problem: a comparative study

In this paper we proposed an efficient algorithm to solve the joint replenishment problem to optimality. We perform a computational study to compare the performance of the proposed algorithm with the best one reported in Viswanathan [6]. The study reveals that for large minor set-up costs and moderate major set-up cost, our algorithm outperforms the latter.inventory;joint replenishment;deterministic demand

Controlling inventories in a supply chain: a case study

This article studies specific aspects of the joint replenishment problem in a real supply chain setting. Particularly we analyze the effect on inventory performance of having minimum order quantities for the different products in the joint order, given a complex transportation cost structure. The policies suggested have been tested in a simulation model with real data.Inventory;Supply chain management;Minimum order quantities;Joint replienishment

New Bounds for the Joint Replenishment Problem: Tighter, but not always better

In this paper we present new bounds on the basic cycle time for optimal methods to solve the JRP. They are tighter than the ones reported in Viswanathan [7]. We carry out extensive numerical experiments to compare them and to investigate the computational complexity.computational complexity;joint replenishment problem;bounds

Generalized Solutions for the joint replenishment problem with correction factor

In this paper we give a complete analysis of the joint replenishment problem (JRP) under constant demands and continuous time. We present a solution method for the JRP when a correction is made for empty replenishments, and we test the solution procedures with real data. We show that the solutions obtained differ from the standard JRP when no correction is made in the cost function. We further show that the JRP with correction outperforms independent ordering. Additional numerical experiments are presented.inventory;joint replenishment;correction factor

Determination of recovery effort for a probabilistic recovery system under various inventory control policies

In this study we investigate the desired level of recovery under various inventory control policies when the success of recovery is probabilistic. Recovery process is modelled as a single stage operation and recovery effort is represented by the expected time spent for it. The effect of increasing recovery effort on the success probability together with unit cost of the operation is included by assuming general forms of dependencies. The desired level of recovery is investigated under four inventory control policies for a wide range of system parameters. In this article, we present our computational results and their managerial implications.inventory control;probabilistic recovery

An efficient optimal solution method for the joint replenishment problem with minimum order quantities

We study the joint replenishment problem (JRP) for M items under deterministic demand, with a minimum order quantity constraint for each item in the replenishment order. We first study an iterative procedure that proves to be not efficient in this case. Further, we derive bounds on the basic cycle time and propose an efficient global optimisation procedure to solve the JRP with constraints. Moreover, we also consider the case where a correction is made for empty replenishment occasions. The algorithms are tested in a real case

Controlling Inventories in a Supply Chain

This article studies specific aspects of the joint replenishment problem in a real supply chain setting. Particularly we analyze the effect on inventory performance of having minimum order quantities for the different products in the joint order, given a complex transportation cost structure. The policies suggested have been tested in a simulation model with real data

New Bounds for the Joint Replenishment Problem: Tighter, but not always better

In this paper we present new bounds on the basic cycle time for optimal methods to solve the JRP. They are tighter than the ones reported in Viswanathan [7]. We carry out extensive numerical experiments to compare them and to investigate the computational complexity

Generalized Solutions for the joint replenishment problem with correction factor

In this paper we give a complete analysis of the joint replenishment problem (JRP) under constant demands and continuous time. We present a solution method for the JRP when a correction is made for empty replenishments, and we test the solution procedures with real data. We show that the solutions obtained differ from the standard JRP when no correction is made in the cost function. We further show that the JRP with correction outperforms independent ordering. Additional numerical experiments are presented

On the efficiency of optimal algorithms for the joint replenishment problem: a comparative study

In this paper we proposed an efficient algorithm to solve the joint replenishment problem to optimality. We perform a computational study to compare the performance of the proposed algorithm with the best one reported in Viswanathan [6]. The study reveals that for large minor set-up costs and moderate major set-up cost, our algorithm outperforms the latter